Graded Cohen–Macaulay Domains and Lattice Polytopes with Short h-Vector

نویسندگان

چکیده

Let P be a lattice polytope with the $$h^{*}$$ -vector $$(1, h^*_1, \ldots , h^*_s)$$ . In this note we show that if $$h_s^* \le h_1^*$$ then Ehrhart ring $${\mathbb {k}}[P]$$ is generated in degrees at most $$s-1$$ as {k}}$$ -algebra. particular, $$s=2$$ and $$h_2^* IDP. To see this, corresponding statement for semi-standard graded Cohen–Macaulay domains over algebraically closed fields.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lattice 3-Polytopes with Few Lattice Points

This paper is intended as a first step in a program for a full algorithmic enumeration of lattice 3-polytopes. The program is based in the following two facts, that we prove: • For each n there is only a finite number of (equivalence classes of) 3polytopes of lattice width larger than one, where n is the number of lattice points. Polytopes of width one are infinitely many, but easy to classify....

متن کامل

Sampling Short Lattice Vectors and the Closest Lattice Vector Problem

We present a 2 O(n) time Turing reduction from the closest lattice vector problem to the shortest lattice vector problem. Our reduction assumes access to a subroutine that solves SVP exactly and a subroutine to sample short vectors from a lattice, and computes a (1+)-approximation to CVP. As a consequence, using the SVP algorithm from 1], we obtain a randomized 2 O(1+ ?1)n algorithm to obtain a...

متن کامل

polymake and Lattice Polytopes

The polymake software system deals with convex polytopes and related objects from geometric combinatorics. This note reports on a new implementation of a subclass for lattice polytopes. The features displayed are enabled by recent changes to the polymake core, which will be discussed briefly.

متن کامل

EXTENDABLE SHELLING, SIMPLICIAL AND TORIC h-VECTOR OF SOME POLYTOPES

We show that the stellar subdivisions of a simplex are extendably shellable. These polytopes appear as the facets of the dual of a hypersimplex. Using this fact, we calculate the simplicial and toric h-vector of the dual of a hypersimplex. Finally, we calculate the contribution of each shelling component to the toric h-vector.

متن کامل

Lattice Points inside Lattice Polytopes

We show that, for any lattice polytope P ⊂ R, the set int(P ) ∩ lZ (provided it is non-empty) contains a point whose coefficient of asymmetry with respect to P is at most 8d · (8l+7) 2d+1 . If, moreover, P is a simplex, then this bound can be improved to 9 · (8l+ 7) d+1 . This implies that the maximum volume of a lattice polytope P ⊂ R d containing exactly k ≥ 1 points of lZ in its interior, is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete and Computational Geometry

سال: 2021

ISSN: ['1432-0444', '0179-5376']

DOI: https://doi.org/10.1007/s00454-021-00342-z